A New Approach to Two-Machine Flow Shop Problem with Uncertain Processing Times
نویسندگان
چکیده
This paper deals with the problem of optimization of job sequence in a two-machine flow shop problem in the presence of uncertainty. It is assumed that the processing times of jobs on the machines are described by triangular fuzzy sets. A new optimization algorithm based on Johnson’s algorithm for deterministic processing times and on an improvement of McCahon & Lee’s algorithm is developed and presented. In order to compare fuzzy processing times, McCahon and Lee use mean values of their corresponding fuzzy sets. It is shown that this approach cannot fully explore possible relationships between fuzzy sets. In order to overcome this drawback we consider different fuzzy sets determined by -cuts of the fuzzy processing times. Extensive experiments show that the new algorithm gives better solutions with respect to makespan than existing McCahon and Lee’s algorithm.
منابع مشابه
A New Approach Generating Robust and Stable Schedules in m-Machine Flow Shop Scheduling Problems: A Case Study
This paper considers a scheduling problem with uncertain processing times and machine breakdowns in industriall/office workplaces and solves it via a novel robust optimization method. In the traditional robust optimization, the solution robustness is maintained only for a specific set of scenarios, which may worsen the situation for new scenarios. Thus, a two-stage predictive algorithm is prop...
متن کاملA Mathematical Model for a Flow Shop Scheduling Problem with Fuzzy Processing Times
This paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. In the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). However,, two significant criteria for each schedule in stochastic models are: expectable m...
متن کاملCustomer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop
This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...
متن کاملFuzzy Multi-objective Permutation Flow Shop Scheduling Problem with Fuzzy Processing Times under Learning and Aging Effects
In industries machine maintenance is used in order to avoid untimely machine fails as well as to improve production effectiveness. This research regards a permutation flow shop scheduling problem with aging and learning effects considering maintenance process. In this study, it is assumed that each machine may be subject to at most one maintenance activity during the planning horizon. The objec...
متن کاملA New Approach to Two-Machine Flow Shop Problem with Uncertain Processing Time
In this paper, we make an improvement on McCahon and Lee’s algorithm for two-machine flow shop problem with uncertain processing time represented with fuzzy number. Especially, the scheme used in McCahon and Lee’s algorithm for ranking fuzzy processing times is modified to calculate better the minimum makespan. Example and extensive simulation results are presented to show the improved performa...
متن کاملMinimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop
[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...
متن کامل